Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations
نویسندگان
چکیده
We give a linear-time algorithm to decide 3-colorability (and find a 3coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.
منابع مشابه
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
We give a linear-time algorithm to decide 3-colorability of a trianglefree graph embedded in a fixed surface, and a quadratic-time algorithm to output a 3-coloring in the affirmative case. The algorithms also allow to prescribe the coloring for a bounded number of vertices.
متن کاملColoring triangle - free graphs on surfaces . Extended
Gimbel and Thomassen asked whether 3-colorability of a triangle-free graph drawn on a fixed surface can be tested in polynomial time. We settle the question by giving a linear-time algorithm for every surface which combined with previous results gives a lineartime algorithm to compute the chromatic number of such graphs. Our algorithm is based on a structure theorem that for a triangle-free gra...
متن کاملComplexity of the conditional colorability of graphs
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex v of degree d(v) in G is adjacent to vertices with at least min{r, d(v)} different colors. The smallest integer k for which a graph G has a conditional (k, r)-coloring is called the rth order conditional chromatic number, denoted by χr(G). It is easy to see that th...
متن کاملFine structure of 4-critical triangle-free graphs III. General surfaces
Dvořák, Král’ and Thomas [4, 6] gave a description of the structure of triangle-free graphs on surfaces with respect to 3-coloring. Their description however contains two substructures (both related to graphs embedded in plane with two precolored cycles) whose coloring properties are not entirely determined. In this paper, we fill these gaps.
متن کاملComplexity of Coloring Graphs without Paths and Cycles
Let Pt and C` denote a path on t vertices and a cycle on ` vertices, respectively. In this paper we study the k-coloring problem for (Pt, C`)-free graphs. Maffray and Morel, and Bruce, Hoang and Sawada, have proved that 3-colorability of P5-free graphs has a finite forbidden induced subgraphs characterization, while Hoang, Moore, Recoskie, Sawada, and Vatshelle have shown that k-colorability of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1509.01013 شماره
صفحات -
تاریخ انتشار 2015